package 区间算法;

import java.util.Arrays;

/**
 * https://leetcode.cn/problems/non-overlapping-intervals/description/
 */
public class _435_无重复区间 {

    public int eraseOverlapIntervals(int[][] intervals) {
        return 0;
    }

}
